Basic Process Algebra with Iteration: Completeness of its Equational Axioms
نویسندگان
چکیده
منابع مشابه
Basic Process Algebra with Iteration: Completeness of its Equational Axioms
Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based on the axioms, and prove that this term rewriting system is terminating, and that bisimilar normal forms...
متن کاملRAPPORT Basic process algebra with iteration : completeness of its equational axioms
REPORTRAPPORT Basic process algebra with iteration: completeness of its equational axioms Abstract Bergstra, Bethke & Ponse BBP93] proposed an axiomatisation for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatisation is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based ...
متن کاملEquational Axioms of Test Algebra
We present a complete axiomatization of test algebra the two sorted algebraic variant of Propositional Dynamic Logic PDL The axiomatization consists of adding a nite number of equations to any axiomatization of Kleene algebra and algebraic translations of the Segerberg axioms for PDL Kleene algebras are not nitely axiomatizable so our result does not give us a nite axiomatization of test algebr...
متن کاملProcess Algebra with Iteration
We introduce iteration in process algebra by means of (the binary version of) Kleene's star operator: x y is the process that chooses between x and y, and upon termination of x has this choice again. It is proved that adding respectively interleaving, communication and abstraction operators increases expressivity up to the regular processes. However, if the distinction between (successful) term...
متن کاملComplete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration
We study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting of process algebra. To represent the infinite behavior, we consider the prefix iteration extension of a fragment of Milner’s CCS. The prefix iteration operator is a variant on the binary version of the Kleene star operator obtained by restricting the first argument to be an atomic action and allows us to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1994
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/37.4.259